منابع مشابه
Hitting Hotspots: Spatial Targeting of Malaria for Control and Elimination
1 Department of Immunity and Infection, London School of Hygiene & Tropical Medicine, London, United Kingdom, 2 Department of Medical Microbiology, Radboud University Nijmegen Medical Centre, Nijmegen, The Netherlands, 3 Department of Epidemiology, Biostatistics, and HTA, Radboud University Nijmegen Medical Centre, Nijmegen, The Netherlands, 4 Department of Infectious Disease Epidemiology, MRC ...
متن کاملBnB-ADOPT+ with Several Soft AC Levels
Distributed constraint optimization problems can be solved by BnBADOPT$^+$, a distributed asynchronous search algorithm. In the centralized case, local consistency techniques applied to constraint optimization have been shown very beneficial to increase performance. In this paper, we combine BnB-ADOPT$^+$ with different levels of soft arc consistency, propagating unconditional deletions caused ...
متن کاملEconomic analysis of several types of malaria clinics in Thailand.
The costs of three types of malaria clinics in Maesot District, north-west Thailand, for a one-year period in 1985-86 were compared from the institutional, community and social (institutional plus community) perspectives. The greatest number of patients at the lowest average institutional cost per smear and per positive case diagnosed (US$ 0.82) were seen at the large central clinic in Maesot t...
متن کاملOn the Hitting Set of Bundles Problem
Le problème de l’ensemble minimal de paquets (minimal hitting set of bundles problem ou HSB) est défini comme suit. On dispose d’un ensemble E = {e1, e2, . . . , en} de n éléments. Chaque élément ei (i = 1, . . . , n) a un coût positif ou nul ci. Un paquet b est un sous ensemble de E . On dispose aussi d’une collection S = {S1, S2, . . . , Sm} de m ensembles de paquets. De manière plus précise,...
متن کاملImproved Results on Geometric Hitting Set Problems
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of points that hit all geometric objects. The problem is known to be strongly NP-hard even for simple geometric objects like unit disks in the plane. Therefore, unless P=NP, it is not possible to get Fully Polynomial Time ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Reviews Microbiology
سال: 2016
ISSN: 1740-1526,1740-1534
DOI: 10.1038/nrmicro.2016.146